Multiresolution Path-planning with Waiting Strategies in Spatiotemporally-varying Threat Fields

نویسندگان

  • Benjamin Cooper
  • Raghvendra V. Cowlagi
چکیده

We address the problem of finding an optimal path for a vehicle in a planar environment where traversal costs are based on a time-varying spatial field defined over the environment. The resulting optimal path may contain instances of ’waiting’, where the vehicle hovers, parks, or loiters. We develop a test condition for evaluting beneficial waiting based on the local characteristics of the threat field at the current vehicle location. Numerical simulations are used to demonstrate the benefit of waiting given certain field characteristics. The cost reduction and computation benefits of the local field test condition are also evaluated. In the multiresolution analysi we assume that the accuracy with which the values of the spatial field are known gradually decreases with increasing distance from the vehicle’s current location. To extend previous results in the literature, we present a wavelet transform-based multiresolution motion-planning approach that incorporates traversal and waiting costs based on a time-varying spatial field and present preliminary results regarding cost-reduced paths due to waiting and computational performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiresolution Aircraft Guidance in a Spatiotemporally-varying Threat Field

We consider the problem of generating an optimal aircraft reference trajectory in a horizontal plane, where the objective is to minimize exposure to a spatiotemporally varying scalar field. We consider a special case, where this field is timeinvariant, and we discuss optimal trajectory generation for an aircraft kinematic model based on firstand second-order necessary conditions of optimal cont...

متن کامل

Approximation Solutions for Time-Varying Shortest Path Problem

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...

متن کامل

Linear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization

In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...

متن کامل

Effective strategies for the establishment of integration model for succession planning and career progression path of iranian azad universities administrators (Qualitative Research Based Grounded Theory Approach)

• AbstractThis research was done to provide effective strategies for the establishment of integration model for succession planning and career progression path of azad universities administrators from the perspective of higher education administrators and professionals based on the systematic theoretical design of Strauss and Corbin grounded theory. Accordingly, using a targeted sampling method...

متن کامل

Region Completion in a Texture using Multiresolution Transforms

Abstract Natural images, textures and photographs are likely to be impaired by stains.  As a result a substantial portion of the image remains blurred. However, a method called region completion is adopted to fill in the tainted part by using the information from the portion left unblemished by stains. A novel method to perform this operation is proposed in this paper. The three significant sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017